Polyadic Quantification via Denoting Concepts

نویسنده

  • Ori Simchen
چکیده

The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell’s 1903 theory of denoting concepts, which is the main object of criticism in his 1905 “On Denoting.” It is shown that, appearances to the contrary notwithstanding, the background ontology of the earlier theory of denoting enables the full-blown expressive power of first-order polyadic quantification theory without any syntactic accommodation of scopal differences among denoting phrases such as ‘all φ’, ‘every φ’, and ‘any φ’ on the one hand, and ‘some φ’ and ‘a φ’ on the other. The case provides an especially vivid illustration of the general point that structural (or ideological) austerity can be paid for in the coin of ontological extravagance.

منابع مشابه

Ideals in a Polyadic Algebra1

In an important sequence of papers, Halmos has developed the beautiful and significant theory of algebraic logic. The central mathematical object of this theory is the polyadic algebra, which incorporates in an axiomatic way the concepts of substitution, transformation, and quantification for the lower functional calculus. The beauty of the theory is revealed by the fact that the semantic compl...

متن کامل

Negation and negative concord in a polyadic quantification framework

This paper addresses the two interpretations a combination of negative indefinites can get in concord languages like French, namely a concord reading which amounts to a single negation, or a double negation reading. I defend a polyadic approch in which a sequence of negative indefinites can be interpreted as iteration of quantifiers or as resumption. The first option leads to a scopal relation,...

متن کامل

On The Theory of Meaning of “On Denoting”

Russell’s theories of denoting, beginning with the early theory of denoting concepts of The principles of mathematics and the unpublished intermediate studies, and culminating in the theory of “On denoting,” exemplify the characteristic features of a semantic theory. As early as the theory of Principles there is a compositional analysis of the logical form of declarative sentences, including se...

متن کامل

Categorematic unreducible polyadic quantifiers in Lexical Resource Semantics

Early work on quantification in natural languages showed that sentences like Every ape picked different berries, on the reading that the sets of berries picked by any two apes are not the same, can be logically represented with a single polyadic quantifier for the two nominal phrases. However, since that quantifier cannot be decomposed into two quantifiers for the two nominal phrases, a composi...

متن کامل

Topology Proceedings

We prove a theorem whose countable version is that a zero-dimensional polyadic space of countable tightness is a Uniform Eberlein compact space. We prove that if a point p of a polyadic space Y has πχ(p, Y ) = κ > ω, then there exists K ⊂ Y such that p ∈ K and K is homeomorphic to the Cantor cube 2.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 51  شماره 

صفحات  -

تاریخ انتشار 2010